perm filename IDEAS[S84,JMC]1 blob
sn#752006 filedate 1984-04-28 generic text, type C, neo UTF8
COMMENT ā VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 ideas[s84,jmc] circum vs. default logic
C00004 ENDMK
Cā;
ideas[s84,jmc] circum vs. default logic
default logic can infer consistency of arith, but disj. and circum
is more nearly effective
takasu
1. We infer that something is best, because it is consistent that it
the best. Circumscribe better(x,candidate).
2. The bolder conjectures are made by circumscribing w/r subsets
of the available facts.
apr 23
What about a program that investigated what words and phrases a person used
frequently and then offered a set of macros that abbreviated them?
One cculd imagine putting E or some other editor in a collect mode
for the purpose of accumulating the statistics.
apr 28
Can we get termination of Ackermann function by a simple recursion
on a higher type? What about the Goodstein function? Perhaps it
requires recursion of some transfinite type. What about higher
combinators? Is there some generalization of mapcar which is
a combinator?